package com.nan.leetcode.链表.删除链表中重复元素;

class ListNode {
    int val;
      ListNode next;
      ListNode() {}
      ListNode(int val) { this.val = val; }
      ListNode(int val, ListNode next) { this.val = val; this.next = next; }
  }
public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        if(head==null){
            return null;
        }
        ListNode cur=head;
        while(cur.next!=null)
            if(cur.val==cur.next.val){
                cur.next=cur.next.next;//如果一样删除，想得到cur.next.next就得先判断cur.next不为空
            }else{
                cur=cur.next;
        }
        return head;
    }
}
